The Not-so-Magic Magic Barrier of Recommender Systems

نویسندگان

  • Alejandro Bellogín
  • Alan Said
چکیده

Recommender Systems need to deal with different types of users who represent their preferences in various ways. This difference in user behaviour has a deep impact on the accuracy of the recommendations received by the users, depending, mostly, on the quantity and the quality of the information the system knows about the user. Specifically, the inconsistencies of the user impose a lower bound on the error the system may achieve when predicting ratings for that particular user [3]. In our work [1], we analyse how the consistency of user ratings (coherence) may predict the performance of recommendation methods. More specifically, our results show that our definition of coherence is correlated with the so-called magic barrier of recommender systems [2], and thus, it could be used to discriminate between easy users (those with a low magic barrier, that is, with a low natural variability in their behaviour) and difficult ones (those with a high magic barrier). Furthermore, in our experiments (using a real movie dataset) the rating prediction error for the more coherent users is significantly lower than that of the less coherent ones. BODY We show that the magic barrier of recommender systems is not magic at all. In fact, it is an easily computed statistical rating property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Magic Barrier of Recommender Systems - No Magic, Just Ratings

Recommender Systems need to deal with different types of users who represent their preferences in various ways. This difference in user behaviour has a deep impact on the final performance of the recommender system, where some users may receive either better or worse recommendations depending, mostly, on the quantity and the quality of the information the system knows about the user. Specifical...

متن کامل

A Contemplation in Shari'a's View towards the Magic with an Approach to Mawlana's Thoughts

The magic is something with a subtle source, which is not seen with eye, and its source cannot be found in a normal way. The magic has a variety of forms that have harmful and non-harmful effects. The wizards use the latter one to deceive people. The motive for choosing this topic among other ones is that some people resort to the magic for different reasons such as: outbreaking demons for the ...

متن کامل

Totally magic cordial labeling of some graphs

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

متن کامل

$Z_k$-Magic Labeling of Some Families of Graphs

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • TinyToCS

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2015